HTN Planning as Heuristic Progression Search
نویسندگان
چکیده
منابع مشابه
HTN Planning with Quantitative Preferences via Heuristic Search
In this paper, we address the problem of generating preferred plans by combining the procedural control knowledge specified by Hierarchical Task Networks (HTNs) with rich user preferences. To this end, we extend the popular Plan Domain Description Language, PDDL3, to support specification of preferences over HTN constructs. To compute preferred HTN plans, we propose a branch-and-bound algorithm...
متن کاملApplying Anytime Heuristic Search to Cost-Optimal HTN Planning
This paper presents a framework for cost-optimal HTN planning. The framework includes an optimal algorithm combining a branch-and-bound with a heuristic search, which can also be used as a near-optimal algorithm given a time limit. It also includes different heuristics based on weighted cost estimations and different decomposition strategies. The different elements from this framework are empir...
متن کاملAn Admissible HTN Planning Heuristic
Hierarchical task network (HTN) planning is wellknown for being an efficient planning approach. This is mainly due to the success of the HTN planning system SHOP2. However, its performance depends on hand-designed search control knowledge. At the time being, there are only very few domainindependent heuristics, which are designed for differing hierarchical planning formalisms. Here, we propose ...
متن کاملPlanning as heuristic search
In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics from Strips encodings. They differ from specialized problem solvers such as those developed for the 24-Puz...
متن کاملPlanning as Heuristic Search: New Results
In the recent AIPS98 Planning Competition, the hsp planner , based on a forward state search and a suitable domain-independent heuristic, showed that heuristic search planners can be competitive with state of the art Graphplan and Satissability planners. hsp solved more problems than the other planners but often took more time or produced longer plans. The bottleneck in hsp is the computation o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2020
ISSN: 1076-9757
DOI: 10.1613/jair.1.11282